-
Notifications
You must be signed in to change notification settings - Fork 0
/
Year 30 - Fill the Floor
248 lines (247 loc) · 2.88 KB
/
Year 30 - Fill the Floor
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
-- 7 Billion Humans (2212:2214M) --
-- 30: Fill the Floor by @commonnickname --
mem1 = nearest wall
mem4 = nearest printer
takefrom mem4
mem2 = nearest wall
if mem1 == mem2:
step w
drop
mem1 = nearest datacube
takefrom mem4
step sw
drop
step mem1
takefrom mem4
step sw
step se
drop
step mem1
takefrom mem4
step se
step sw
step w
drop
step mem1
takefrom mem4
step se
step sw
step sw
drop
step mem1
takefrom mem4
step se
step sw
step s
drop
step mem1
takefrom mem4
step e
drop
mem3 = nearest datacube
takefrom mem4
step se
drop
step mem3
takefrom mem4
step se
step s
step s
drop
step mem3
takefrom mem4
step se
step s
drop
step mem3
takefrom mem4
step se
step se
step e
step e
step e
step e
drop
mem2 = nearest datacube
step mem3
takefrom mem4
step se
step mem2
step e
drop
step mem3
takefrom mem4
step se
drop
end
else:
step w
mem1 = nearest datacube
step w
if c == datacube:
step w
if c == datacube:
step w
if c == datacube:
step n
step e
step e
step ne
step se
step e
step e
step s
if c == datacube:
step e
if c == datacube:
step e
endif
endif
drop
mem2 = nearest datacube
step s
step w
step w
step w
step n
takefrom mem4
step se
step mem2
step s
drop
mem3 = nearest datacube
step w
step w
step w
step n
mem1 = nearest datacube
takefrom mem4
step se
step mem3
step s
drop
mem3 = nearest datacube
step mem1
takefrom mem4
step se
step mem3
step s
drop
step mem1
takefrom mem4
step ne
step mem2
step n
drop
mem2 = nearest datacube
step mem1
takefrom mem4
step ne
step mem2
step n
drop
if w == nothing:
mem3 = nearest wall
else:
if e != wall:
mem3 = nearest printer
else:
end
endif
endif
step mem1
takefrom mem4
step ne
step mem2
step nw
step w
step w
drop
step mem1
takefrom mem4
step ne
if mem3 == wall:
step n
endif
drop
end
endif
endif
endif
endif
drop
mem2 = nearest datacube
takefrom mem4
step sw
step mem2
step s
drop
mem3 = nearest datacube
step mem1
takefrom mem4
step sw
step mem3
step s
drop
mem3 = nearest datacube
step mem1
takefrom mem4
step sw
step mem3
step s
drop
step mem1
takefrom mem4
step nw
step mem2
step n
drop
mem2 = nearest datacube
step mem1
takefrom mem4
step nw
step mem2
step n
drop
if e == nothing:
mem2 = nearest wall
endif
step mem1
takefrom mem4
step sw
step mem3
step se
step e
step e
step e
step e
step e
step e
step e
step e
drop
if mem2 != wall:
if w != nothing:
mem1 = nearest datacube
step w
step nw
step w
pickup nw
step mem1
step n
drop
endif
end
endif
step mem3
step mem1
takefrom mem4
step nw
drop
step s
takefrom mem4
step n
drop
step sw
takefrom mem4
drop